Transformation-Based Bottom-Up Computation Of The Well-Founded Model
ثبت نشده
چکیده
منابع مشابه
Transformation - Based Bottom - Up Computationof the Well - Founded
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs. Our method is based on the elementary program transformations studied by Brass and Dix 6, 7]. However, their \residual program" can grow to exponential size, whereas for function-free programs our \program remain-der" is always polynomial in the size, i.e. the number of tuples, of t...
متن کاملTransformation-Based Bottom-Up Computation of the Well-Founded Model
We present a framework for expressing bottom-up algorithms to compute the well-founded model of non-disjunctive logic programs. Our method is based on the notion of conditional facts and elementary program transformations studied by Brass and Dix in (Brass & Dix, 1994; Brass & Dix, 1999) for disjunctive programs. However, even if we restrict their framework to nondisjunctive programs, their “re...
متن کاملStabel Model Implementation of Layer Supported Models by Program Transformation
• For practical applications, availability of a top-down query-driven procedure is most convenient for ease of use and efficient computation of answers, when employing Logic Programs as knowledge bases • 2-valued semantics for Normal Logic Programs (NLPs) allowing top-down query-solving is highly desirable, but the Stable Models semantics (SM) does not permit it, for lack of the " relevance " p...
متن کاملTransformation - Based Bottom - Upcomputation of the Well - Foundedmodel Stefan
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs. Our method is based on the elementary program transformations studied by Brass and Dix BD94, BD97, BD98a]. However, their \residual program" can grow to exponential size, whereas for function-free programs our \program remain-der" is always polynomial in the size of the extensional ...
متن کاملMagic Computation for Wll-founded Semantics
We propose a new realization of goal-directed query evaluation of (non-oundering) normal logic programs for the well-founded semantics. To this end we introduce a new magic templates transformation and give a new xed point characterization of the well-founded semantics, lifting an existing deenition from the ground to the non-ground case. The new xed point characterization enables us to show a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994